Computational experience with parallel mixed integerprogramming in a distributed environment

Numerical experiments for a parallel implementation of a branch-and-bound mixed 0y1 integer programming code are presented. Among its features, the code includes cuttingplane generation at the root node, and employs a new branching-variable selection rule within the search tree. The code runs on a loosely-coupled cluster of workstations using TreadMarks as the parallel software platform. Numerical tests were performed on all mixed 0y1 MIPLIB instances as well as two previously unsolved MIP instances, one arising from telecommunication networks and the other a multicommodity flow problem.